Sequence- and time-dependent maintenance scheduling in twice re-entrant flow shops

Industrial and academic interest converge on scheduling flow shops with sequence- time-dependent maintenance. We posit that anticipatory, integrated of operational maintenance tasks leads to superior performance purely ‘wait-then-fix’ handling the tasks. Motivated by an industrial problem (sequence dependent) setup times, maximum separation constraints, a combination time- dependent tasks, this paper introduces integer programming solution, constraint solution heuristic based list scheduling. The motivating use case provides unique concerns is best our knowledge, not yet studied in literature. build existing work where we can extending models for sequence-dependent accommodate also propose other new models. show relative performances methods through empirical evaluations significant improvements – up 25% reduction makespan when compared reactive approach does consider its planning. Based exact methods, scale better than mixed problem.